Shortest Paths for a Two-robot Rendez-vous
نویسندگان
چکیده
In this paper, we consider an optimal motion planning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the robots can travel to move from their initial positions to positions in which they are able to communicate. In order to communicate, the robots need to be visible to one another. We give e cient algorithms for minimizing either the sum or the maximum of the two path lengths.
منابع مشابه
Modelling Remote Concurrency with Ada. Case Study of Symmetric Non-deterministic Rendez-vous. Modelling Remote Concurrency with Ada. Case Study of Symmetric Non-deterministic Rendez-vous
When developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide platform-independent abstractions but, as the platform concurrency behaviour cannot be ignored, this abstraction level must also be able to cope with it and exhibit the influence of different possible behaviours. We st...
متن کاملA Eulerian approach to the analysis of rendez-vous algorithms
In this paper we analyze rendez-vous algorithms in the situation when agents can only exchange information below a given distance threshold R. We study the system under an Eulerian point of view considering (possibly continuous) probability distributions of agents and we present convergence results both in discrete and in continuous time. The limit distribution is always necessarily a convex co...
متن کاملResurrecting Ada's Rendez-Vous in Java
Java is a programming language designed with concurrency in mind from its inception. However, the synchronization mechanism provided is a restricted version of Hoare’s Monitors, being too low level for most applications. In this paper we propose a high level synchronization mechanism for Java, based on Ada’s Rendez-Vous, adapting the notation and semantics to Java. The result is a nice and read...
متن کاملPartial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness
If synchronizing (rendez-vous) communications are used in the Promela models, the unless construct and the weak fairness algorithm are not compatible with the partial order reduction algorithm used in Spin's veri er. After identifying the wrong partial order reduction pattern that causes the incompatibility, we give solutions for these two problems. To this end we propose corrections in the ide...
متن کاملPartial Order Reduction in Presence of Rendez-vous Communications with Priority Choice and Weak Fairness
If synchronizing (rendez-vous) communications are used in Promela models, the priority choice feature (unless construct) and the weak fairness algorithm are not compatible with the partial order reduction algorithm used in Spin’s verifier. After identifying the wrong partial order reduction pattern that causes both incompatibilities, we give solutions to these two problems. To this end we propo...
متن کامل